Left dihedral codes over Galois rings ${\rm GR}(p^2,m)$
نویسندگان
چکیده
Let D2n = 〈x, y | x = 1, y = 1, yxy = x〉 be a dihedral group, and R = GR(p, m) be a Galois ring of characteristic p and cardinality p where p is a prime. Left ideals of the group ring R[D2n] are called left dihedral codes over R of length 2n, and abbreviated as left D2n-codes over R. Let gcd(n, p) = 1 in this paper. Then any left D2n-code over R is uniquely decomposed into a direct sum of concatenated codes with inner codes Ai and outer codes Ci, where Ai is a cyclic code over R of length n and Ci is a skew cyclic code of length 2 over an extension Galois ring or principal ideal ring of R, and a generator matrix and basic parameters for each outer code Ci is given. Moreover, a formula to count the number of these codes is obtained, the dual code for each left D2n-code is determined and all self-dual left D2ncodes and self-orthogonal left D2n-codes over R are presented, respectively.
منابع مشابه
A Gilbert-Varshamov type bound for linear codes over Galois rings
In this paper we derive a Gilbert-Varshamov type bound for linear codes over Galois rings. For linear codes over the Galois ring GR(pl; j) the result can be stated as follows. Given r; such that 0 < r < 1 and 0 < H 1 pj (1 r): Then for all n N; where N is a sufficiently large integer, there exist [n; k] GR linear codes over GR(pl; j) such that k=n r and d=n : Consequently, this bound does not g...
متن کاملGeneralized Extended Hamming Codes over Galois Ring of Characteristic $2^{n}$
In this paper, we introduce generalized extended Hamming codes over Galois rings GR(2,m) of characteristic 2 with extension degree m. Furthermore we prove that the minimum Hamming weight of generalized extended Hamming codes over GR(2,m) is 4 and the minimum Lee weight of generalized extended Hamming codes over GR(8,m) is 6 for all m ≥ 3. ——————————————————————– ———Received May 25, 2011. This w...
متن کاملConstruction of MDS self-dual codes over Galois rings
The purpose of this paper is to construct nontrivial MDS self-dual codes over Galois rings. We consider a building-up construction of self-dual codes over Galois rings as a GF(q)-analogue of [20]. We give a necessary and sufficient condition on which the building-up construction holds. We construct MDS self-dual codes of lengths up to 8 over GR(3, 2), GR(3, 2) and GR(3, 2), and near-MDS self-du...
متن کاملSkew constacyclic codes over Galois rings
We generalize the construction of linear codes via skew polynomial rings by using Galois rings instead of finite fields as coefficients. The resulting non commutative rings are no longer left and right Euclidean. Codes that are principal ideals in quotient rings of skew polynomial rings by a two sided ideals are studied. As an application, skew constacyclic self-dual codes over GR(4) are constr...
متن کاملEnumeration and construction of additive cyclic codes over Galois rings
Let R = GR(p, l) be a Galois ring of characteristic p and cardinality pεl, where p and l are prime integers. First, we give a canonical form decomposition for additive cyclic codes over R. This decomposition is used to construct additive cyclic codes and count the number of such codes, respectively. Thenwe give the trace dual code for each additive cyclic code over R from its canonical form dec...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016